Eigenvalues and extremal degrees of graphs
نویسندگان
چکیده
منابع مشابه
Eccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملInequalities on Vertex Degrees, Eigenvalues and (Signless) Laplacian Eigenvalues of Graphs
Several inequalities on vertex degrees, eigenvalues, Laplacian eigen-values, and signless Laplacian eigenvalues of graphs are presented in this note. Some of them are generalizations of the inequalities in [2]. We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow that in [1]. We use [n] to denote the set of { 1, 2, ..., n}. ...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملExtremal eigenvalues of local Hamiltonians
We apply classical algorithms for approximately solving constraint satisfaction problems to find bounds on extremal eigenvalues of local Hamiltonians. We consider spin Hamiltonians for which we have an upper bound on the number of terms in which each spin participates, and find extensive bounds for the operator norm and ground-state energy of such Hamiltonians under this constraint. In each cas...
متن کاملOn the eigenvalues of non-commuting graphs
The non-commuting graph $Gamma(G)$ of a non-abelian group $G$ with the center $Z(G)$ is a graph with thevertex set $V(Gamma(G))=Gsetminus Z(G)$ and two distinct vertices $x$ and $y$ are adjacent in $Gamma(G)$if and only if $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.06.013